Correlations in random Apollonian network
نویسندگان
چکیده
In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under the assumption of continuous degree, we first give the analytical solution for two node correlations, expressed by average nearest-neighbor degree (ANND). Then, we revisit the degree distribution of RAN using rate equation method and get the exact connection distribution, based on which we derive a more accurate result for mean clustering coefficient as an average quantity of three degree correlations than the one previously reported. Analytical results reveal that ANND has no correlations with respect to degree, while clustering coefficient is dependent on degree, showing a power-law behavior as C(k) ∼ k−1. The obtained expressions are successfully contrasted with extensive numerical simulations.
منابع مشابه
Wheel Random Apollonian Graphs
In this paper a subset of High-Dimensional Random Apollonian networks, that we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some basic graph properties like vertices and edges cardinality, some question concerning cycles and the chromaticity in such type of graphs, we suggest further work on t...
متن کاملLong Paths in Random Apollonian Networks
We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) An. We show that w.h.p. L(n) ≤ ne− log c n for any constant c < 2/3.
متن کاملThe Degree Sequence of Random Apollonian Networks
We analyze the asymptotic behavior of the degree sequence of Random Apollonian Networks [11]. For previous weaker results see [10, 11].
متن کاملParallel Random Apollonian Networks
We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scalefree characteristics. To characterize further the structure of P-RAN, we introduce new parameters that we refer to as the parallel degree and the parallel coefficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007